/*
 * @lc app=leetcode.cn id=324 lang=cpp
 *
 * [324] 摆动排序 II
 */

// @lc code=start
#include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
    struct Info
    {
        int label;
        int cnt;
        Info() : label(0), cnt(0) {}
    };
    void wiggleSort(vector<int> &nums)
    {
        vector<Info> cnt(5001);
        {
            for (size_t i = 0; i < cnt.size(); i++)
            {
                cnt[i].label = i;
            }
            for (auto n : nums)
            {
                cnt[n].cnt++;
            }
        }
        sort(cnt.begin(), cnt.end(),
             [](const Info &l, const Info &r) -> bool
             { return l.cnt > r.cnt; });
        
        auto lit = cnt.begin();
        auto rit = lit + 1;
        while(rit < cnt.end())
        {
            
        }
    }
};
// @lc code=end
